The Accessibility Rank of Weak Equivalences

نویسنده

  • G. RAPTIS
چکیده

We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely accessible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Parametric Failure Equivalences and Their Congruence Formats

Weak equivalences are important behavioral equivalences in the course of specifying and analyzing the reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric failure equivalences, which take two previously-known behavioral equivalences, i.e., the weak failure equivalence and the weak impossible future equivalence, as thei...

متن کامل

Homotopy Limits for 2-categories

We study homotopy limits for 2-categories using the theory of Quillen model categories. In order to do so, we establish the existence of projective and injective model structures on diagram 2categories. Using these results, we describe the homotopical behaviour not only of conical limits but also of weighted limits. Finally, pseudo-limits are related to homotopy limits. 1. Quillen model structu...

متن کامل

Congruence Formats for Weak Readiness Equivalence and Weak Possible Future Equivalence

Weak equivalences are important behavioral equivalences in the course of specifying and analyzing reactive systems using process algebraic languages. In this paper, we propose a series of weak equivalences named weak parametric readiness equivalences, which take two previously-known behavioral equivalences, i.e., the weak readiness equivalence and the weak possible future equivalence, as their ...

متن کامل

Axiomatizations for Probabilistic Finite-State Behaviors

We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguard...

متن کامل

Equivalences in Bicategories

In this paper, we establish some connections between the concept of an equivalence of categories and that of an equivalence in a bicategory. Its main result builds upon the observation that two closely related concepts, which could both play the role of an equivalence in a bicategory, turn out not to coincide. Two counterexamples are provided for that goal, and detailed proofs are given. In par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015